Using Lattices for Reconstructing Stemma
نویسنده
چکیده
The product of textual criticism is an edited text that the editor believes comes as close as possible to a lost original manuscript called the archetype. Usually, the editor compares different manuscripts of a single text, and represents it as an inverted tree showing all the steps in the transmission of a specific text, reconstructed by establishing relationships with other manuscripts. This tree is called the “stemma codicum”(cf. [7]). Because of the graphic proximity of the stemma with a semi-lattice, we propose to use two lattice construction techniques in order to reconstitute the filiation tree of manuscripts. First, we try the traditional methods to build the lattice of a binary relation (cf. [13]). Then a more specific solution to the problem is proposed. These techniques are finally tested on a real corpus of manuscripts by Rimbaud, “Les Effarés” (cf. [17]).
منابع مشابه
Synergy of syntax and morphology in automatic parsing of French language with a minimum of data
of ~ ~ . a sub-stemma is: either the unchanged canonical stemma, or the canonical stemma without a leaf, or a sub-stemma without a leaf. A stemma is a ~ . 9 _ ~ [ L r i ] g j ] . ~ r a m : the vertical dimension of the hierachical levels and the horizontal dimension of the written words; a stemma can be horizontal ly projected to obtain the one dimensional train of words as they are written. He...
متن کاملReconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices
The evaluation of multivariate trigonometric polynomials at the nodes of a rank-1 lattice leads to a onedimensional discrete Fourier transform. Often, one is also interested in the reconstruction of the Fourier coefficients from their samples. We present necessary and sufficient conditions on rank-1 lattices allowing a stable reconstruction of trigonometric polynomials supported on hyperbolic c...
متن کاملHigh-dimensional sparse FFT based on sampling along multiple rank-1 lattices
The reconstruction of high-dimensional sparse signals is a challenging task in a wide range of applications. In order to deal with high-dimensional problems, efficient sparse fast Fourier transform algorithms are essential tools. The second and third authors have recently proposed a dimension-incremental approach, which only scales almost linear in the number of required sampling values and alm...
متن کاملReconstructing hyperbolic cross trigonometric polynomials by sampling along generated sets
The evaluation of multivariate trigonometric polynomials at the nodes of a rank-1 lattice leads to a onedimensional discrete Fourier transform. Often, one is also interested in the reconstruction of the Fourier coefficients from their samples. We present necessary and sufficient conditions on rank-1 lattices allowing a stable reconstruction of trigonometric polynomials supported on hyperbolic c...
متن کاملTopological Residuated Lattices
In this paper, we study the separtion axioms $T_0,T_1,T_2$ and $T_{5/2}$ on topological and semitopological residuated lattices and we show that they are equivalent on topological residuated lattices. Then we prove that for every infinite cardinal number $alpha$, there exists at least one nontrivial Hausdorff topological residuated lattice of cardinality $alpha$. In the follows, we obtain some ...
متن کامل